Gossiping in Bus Interconnection Networks

Several architectures have been proposed to enhance point-to-point architectures with the addition of multiple bus systems. In particular, we consider an architecture for a massively parallel system where processors are connected solely by buses. These archi-tectures can use the power of bus technologies, providing a way to interconnect much more processors in a simple and eecient manner. In this paper we model the so-called bus in-terconnection networks (BINs) by a hypergraph. We consider the gossip operation in the various proposed architectures. We focus on the hyperpath, the d-dimensional hypergrid, the hyperring, and the d-dimensional hypertorus architectures and we give corresponding algorithms for the gossiping operation. Some lower bounds are also derived.